609C - Load Balancing - CodeForces Solution


implementation math *1500

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define size(container) static_cast<int>(container.size())
#define int long long
signed main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<int> A(n);
  for(int i=0; i<n; i++) cin >> A[i];

  sort(begin(A), end(A));
  int sum = accumulate(begin(A), end(A), 0ll);

  vector<int> b(n);
  for(int i=0; i<n; ++i){
    b[i] = sum / n;
    if(i < sum % n)
      b[i]++;
  }

  reverse(begin(b), end(b));

  int ans=0;
  for(int i=0; i<n; ++i)
    ans += abs(A[i] - b[i]);
  cout << ans / 2 << endl;
  return 0;
}


Comments

Submit
0 Comments
More Questions

1547C - Pair Programming
550A - Two Substrings
797B - Odd sum
1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition
1609C - Complex Market Analysis
1657E - Star MST
1143B - Nirvana
1285A - Mezo Playing Zoma
919B - Perfect Number
894A - QAQ
1551A - Polycarp and Coins
313A - Ilya and Bank Account
1469A - Regular Bracket Sequence
919C - Seat Arrangements
1634A - Reverse and Concatenate
1619C - Wrong Addition
1437A - Marketing Scheme
1473B - String LCM
1374A - Required Remainder
1265E - Beautiful Mirrors
1296A - Array with Odd Sum
1385A - Three Pairwise Maximums
911A - Nearest Minimums
102B - Sum of Digits
707A - Brain's Photos
1331B - Limericks
305B - Continued Fractions
1165B - Polycarp Training